Supernodal Symbolic Cholesky Factorization on a Local-Memory Multiprocessor
نویسنده
چکیده
In this paper, we consider the symbolic factorization step in computing the Cholesky factorization of a sparse symmetric positive definite matrix on distributedmemory multiprocessor systems. By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved. Empirical tests demonstrate that there can be drastic reduction in the execution time required by the new algorithm on an Intel iPSC/2 hypercube.
منابع مشابه
A New Recursive Implementation of Sparse Cholesky Factorization
Consider the Cholesky factorization of a sparse symmetric positive de nite matrix, A = LL . The rst two steps use symbolic, graph-theoretic techniques to order A to reduce ll in L, and to determine the exact sparsity structure of L. The factor L is computed in a third \numeric factorization" step. The two leading schemes for numeric factorization are a blocked column-oriented scheme, and a mult...
متن کاملDirect and Incomplete Cholesky Factorizations with Static Supernodes
Introduction Incomplete factorizations of sparse symmetric positive definite (SSPD) matrices have been used to generate preconditioners for various iterative solvers. These solvers generally use preconditioners derived from the matrix system, , in order to reduce the total number of iterations until convergence. In this report, we investigate the findings of ref. [1] on their method for computi...
متن کاملAn Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization
Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system Ax = b when A comes from a discretized partial-differential equat...
متن کاملAn Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines
In this paper we present a comprehensive analysis of the performance of a variety of sparse Cholesky factorization methods on hierarchical-memory machines. We investigate methods that vary along two different axes. Along the first axis, we consider three different high-level approaches to sparse factorization: leftlooking, right-looking, and muhi.frontal. Along the second axis, we consider the ...
متن کاملS+: Efficient 2D Sparse LU Factorization on Parallel Machines
Static symbolic factorization coupled with supernode partitioning and asynchronous computation scheduling can achieve high giga op rates for parallel sparse LU factorization with partial pivoting This paper studies properties of elimination forests and uses them to optimize supernode partitioning amalgamation and execution scheduling It also proposes supernodal matrix multiplication to speed up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Computing
دوره 5 شماره
صفحات -
تاریخ انتشار 1987